Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
41	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
42	Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang University of Toronto Add to Reading List Source URL: www.blogscope.net Language: English - Date: 2012-04-10 15:02:30 Search algorithms Network flow Depth-first search Breadth-first search Correlation clustering Maximum flow problem Flow network Tree Connectivity Graph theory Mathematics Combinatorics
43	A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1 Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2011-05-24 08:45:38 Connectivity SPQR tree Apex graph Shortest path problem Breadth-first search Crossing number Graph theory Mathematics Planar graphs
44	Microsoft Word - revision6-bailando.doc Add to Reading List Source URL: bailando.sims.berkeley.edu Language: English - Date: 2001-11-06 17:37:37 Combinatorics Radial tree Tree Topology Breadth-first search Force-based algorithms B-tree Visualization Node graph architecture Graph drawing Graph theory Mathematics
45	PDF Document Add to Reading List Source URL: www.cis.strath.ac.uk Language: English - Date: 2007-09-05 10:42:25 Science Information science Heuristic function A* search algorithm Best-first search Admissible heuristic Heuristic Breadth-first search Hill climbing Search algorithms Artificial intelligence Heuristics
46	Mean-based Heuristic Search for Real-Time Planning #ID 1 Résumé : In this paper, we introduce a new heuristic search algorithm based on mean values for realtime planning, called MHSP. It consists in associating the pri Add to Reading List Source URL: www.math-info.univ-paris5.fr Language: English - Date: 2012-07-06 09:32:23 Combinatorics A* search algorithm Heuristic function Goal node Breadth-first search Admissible heuristic Heuristic Greedy algorithm Algorithm Search algorithms Mathematics Artificial intelligence
47	PDF Document Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Minimum spanning tree Topology Theoretical computer science Breadth-first search T-tree Mathematics Graph theory Knowledge representation Tree
48	Oblivious Data Structures∗ Xiao Shaun Wang1 , Kartik Nayak1 , Chang Liu1 , T-H. Hubert Chan2 , Elaine Shi1 , Emil Stefanov3 , and Yan Huang4 1 UMD Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2014-10-29 22:55:19 Computer programming Heap B-tree Tree Binary search tree Linked list T-tree Breadth-first search Priority queue Binary trees Graph theory Computing
49	Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs Mohamed Sarwat1 1 Sameh Elnikety2 Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2015-04-07 00:37:53 Database management systems SQL Query optimizer Search algorithms Reachability Graph partition Query plan Breadth-first search FO Graph theory Theoretical computer science Mathematics
50	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:50 Graph Connectivity Collaboration graph Tree Topology Directed acyclic graph Graph theory Graph operations Breadth-first search